Planar graphs decomposable into a forest and a matching
نویسندگان
چکیده
He, Hou, Lih, Shao, Wang, and Zhu showed that a planar graph of girth 11 can be decomposed into a forest and a matching. Borodin, Kostochka, Sheikh, and Yu improved the bound on girth to 9. We give sufficient conditions for a planar graph with 3-cycles to be decomposable into a forest and a matching. c © 2008 Elsevier B.V. All rights reserved.
منابع مشابه
Constructing vertex decomposable graphs
Recently, some techniques such as adding whiskers and attaching graphs to vertices of a given graph, have been proposed for constructing a new vertex decomposable graph. In this paper, we present a new method for constructing vertex decomposable graphs. Then we use this construction to generalize the result due to Cook and Nagel.
متن کاملDecomposing a planar graph with girth 9 into a forest and a matching
W. He et al. showed that a planar graph of girth 11 can be decomposed into a forest and a matching. D. Kleitman et al. proved the same statement for planar graphs of girth 10. We further improve the bound on girth to 9. c © 2007 Elsevier Ltd. All rights reserved.
متن کاملThe Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes
The Matching-Cut problem is the problem to decide whether a graph has an edge cut that is also a matching. Chvátal studied this problem under the name of the Decomposable Graph Recognition problem, and proved the problem to be NP-complete for graphs with maximum degree 4, and gave a polynomial algorithm for graphs with maximum degree 3. Recently, unaware of Chvátal’s result, Patrignani and Pizz...
متن کاملPlanar Graphs and Partial k-Trees
It is well-known that many NP-hard problems can be solved efficiently on graphs of bounded treewidth. We begin by showing that Knuth’s results on nested satisfiability are easily derived from this fact since nested satisfiability graphs have treewidth at most three. Noting that nested satisfiability graphs have a particular form of planar drawing, we define a more general form of graph drawing ...
متن کامل$n$-Array Jacobson graphs
We generalize the notion of Jacobson graphs into $n$-array columns called $n$-array Jacobson graphs and determine their connectivities and diameters. Also, we will study forbidden structures of these graphs and determine when an $n$-array Jacobson graph is planar, outer planar, projective, perfect or domination perfect.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 309 شماره
صفحات -
تاریخ انتشار 2009